A decision method for nonmonotonic reasoning based on autoepistemic reasoning
نویسندگان
چکیده
منابع مشابه
Experience Based Nonmonotonic Reasoning
Within everyday reasoning we often use argumentation patterns that employ the rather vague notion of something being normally true. This form of reasoning is usually captured using Reiter’s Default Logic. However, in Default Logic one has to make explicit the rules which are to be used for reasoning and which are supposed to be normally true. This is a bit contrary to the everyday situation whe...
متن کاملOn the Links Between Argumentation-Based Reasoning and Nonmonotonic Reasoning
In this paper we investigate the links between instantiated argumentation systems and the axioms for nonmonotonic reasoning described in [9] with the aim of characterising the nature of argument based reasoning. In doing so, we consider two possible interpretations of the consequence relation, and describe which axioms are met by ASPIC under each of these interpretations. We then consider the l...
متن کاملNonmonotonic Reasoning Based on Incomplete Logic
What characterizes human reasoning is the ability of deal ing with incomplete information Incomplete logic is developed for modeling incomplete knowledge The most distinctive feature of incomplete logic is its se mantics This is an alternative presentation of partial semantics In this paper we will introduce the general notion of incomplete logic ICL compare it with partial logic and give the r...
متن کاملNonmonotonic Reasoning
In this talk I will give an overview of nonmonotonic reasoning as background, and then address the question of its relevance and importance for theoretical issues in reasoning about knowledge and belief. In the past few years the area. of nonmonotonic reasoning has grown tremendously, as witnessed by the increase in submitted and accepted papers to conferences such as this one. It would be impo...
متن کاملNonmonotonic Reasoning
The purpose of this paper is to expand the syntax and semantics of logic programs and deductive databases to allow for the correct representation of incomplete information in the presence of multiple extensions. The language of logic programs with classical negation, epistemic disjunction, and negation by failure is further expanded by a new modal operator K (where for the set of rules T and fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 1995
ISSN: 0168-7433,1573-0670
DOI: 10.1007/bf00883929